Block Krylov subspace exact time integration of linear ODE systems. Part 1: algorithm description

نویسنده

  • Mike A. Botchev
چکیده

We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y ′ = −Ay+g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decomposition). The second stage is a special residual-based block Krylov subspace method. The accuracy of the method is only restricted by the accuracy of the polynomial approximation and by the error of the block Krylov process. Since both errors can, in principle, be made arbitrarily small, this yields, at some costs, a time-exact method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A block Krylov subspace time-exact solution method for linear ODE systems

We propose a time-exact Krylov-subspace-based method for solving linear ODE (ordinary differential equation) systems of the form y = −Ay + g(t) and y = −Ay + g(t), where y(t) is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of the source term g(t), constructed with the help of the truncated SVD (singular value decompos...

متن کامل

A comparison of AMF- and Krylov-methods in Matlab for large stiff ODE systems

For the efficient solution of large stiff systems resulting from semidiscretization of multi-dimensional partial differential equations two methods using approximate matrix factorizations (AMF) are discussed. In extensive numerical tests of Reaction Diffusion type implemented in Matlab they are compared with integration methods using Krylov techniques for solving the linear systems or to approx...

متن کامل

A block Krylov subspace time-exact solution method for linear ordinary differential equation systems

We propose a time-exact Krylov-subspace-based method for solving linear ordinary differential equation systems of the form y D Ay C g.t/ and y D Ay C g.t/, where y.t/ is the unknown function. The method consists of two stages. The first stage is an accurate piecewise polynomial approximation of the source term g.t/, constructed with the help of the truncated singular value decomposition. The se...

متن کامل

The block grade of a block Krylov space

The aim of the paper is to compile and compare basic theoretical facts on Krylov subspaces and block Krylov subspaces. Many Krylov (sub)space methods for solving a linear system Ax = b have the property that in exact computer arithmetic the true solution is found after ν iterations, where ν is the dimension of the largest Krylov subspace generated by A from r0, the residual of the initial appro...

متن کامل

Ifeast

The FEAST eigenvalue algorithm is a subspace iteration algorithm that uses contour integration in the complex plane to obtain the eigenvectors of a matrix for the eigenvalues that are located in any user-defined search interval. By computing small numbers of eigenvalues in specific regions of the complex plane, FEAST is able to naturally parallelize the solution of eigenvalue problems by solvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1109.5100  شماره 

صفحات  -

تاریخ انتشار 2011